Generates parser/compiler directly from syntax/state diagrams. It permits creating and editing syntax diagrams graphically. It accepts EBNF, ABNF, XBNF descriptions, converting them to syntax diagrams, as well as converting syntax diagrams to EBNF. Scanner functionality is integrated and transparent. Emulation and Trace to confirm Grammar. Direct and Indirect Recursive Term Detection.
Generates Intermediate Postfix Output for ease of integration .
Implements streaming LL parser with stop and restart ability .
Can Represent Binary Grammar and Parse Binary Signatures.
Automated Detection of Direct/Indirect Recursive Terms.
Automated Direct Left Recursive Rule Conversion.
Automated Common Term and Rule Reduction.
Automated insertion of "Repeat 0/1 or More Times".
Create Syntax Diagrams with Precedence.
Scanner functionality inherent within Virtual Parser/State Engine.
Undo/Redo/Cut/Copy/Paste for Graphical and Textual Editing.
Real-time Placement and Routing of Rules and Diagrams.
Print Syntax Diagrams or Paste into other documents.
Graphically edit XML/HTML/PHP/...
Graphical editing with drag and drop. Supports simultanious processing of multiple grammars, orders, and etc with single provided engine. Converts from graphiical syntax diagrams and rules to EBNF. SUpports a mixture of parser, state machine, and petri logic.
It is for software and hardware engineers and CS students who are designing any product requiring logical control or processing.
